An Efficient Space Partitioning Method Using Binary Maps
نویسنده
چکیده
Space partitioning techniques are well known especially because of their use in computer graphics, especially within ray-tracing acceleration techniques. The primary aim of those techniques is to enable fast test whether a geometric object resides at least partially within the given area. There are many modifications that proved the applicability despite of high memory requirements of complexity O(M) for the two dimensional space, resp. O(M) for the three dimensional space. The space division technique is used in standard software packages like PovRay etc. A new technique with O(M) memory complexity and its comparison with original space subdivision and residency mask techniques is presented. Key-Words: Computer graphics, algorithm acceleration, algorithm complexity, space partitioning, space subdivision, residency mask. Notifications: p – number of objects, M number of subdivision in one axis (Mx = Mx = Mx for simplicity)
منابع مشابه
Using Convex Differences in Hierarchical Representations of Polygonal Maps
We discuss adaptive. hierarchical. spatial subdivisions of planar polygonal maps. These maps are extensively used in cartography. GIS. computer graphics and computer vision. Our results are applicable to many subdivision schemes. including quad trees. k-d trees. and binary space partitioning (ESP). We focus on cell splitting rules and leaf organization methods. introducing and comparing three o...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملRobust visual tracking using a fixed multi-camera system
The problem of tracking the position and orientation of a moving object using a stereo camera system is considered in this paper. A robust algorithm based on the extended Kalman filter is adopted, combined with an efficient selection technique of the object image features, based on Binary Space Partitioning tree geometric models. An experimental study is carried nut using a vision system of two...
متن کاملHULK - Simple and fast generation of structured hexahedral meshes for improved subsurface simulations
Short for Hexahedra from Unique Location in (K)convex Polyhedra – HULK is a simple and efficient algorithm to generate hexahedral meshes from generic STL files describing a geological model to be used in simulation tools based on the finite difference, finite volume or finite element methods. Using binary space partitioning of the input geometry and octree refinement on the grid, a successive i...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کامل